Under the hood, Python lists are not loosely linked structures but highly organized ArrayList. The core truth is: it occupies a contiguous block of memory addresses. What is stored here is not the objects themselves, but references to them references(which in C terms are pointers). This design enables unified management of heterogeneous data—whether RGB tuples or complex encryption keys (Key)—each requiring only a fixed-size pointer slot.

Addressing Mathematics and Performance Trade-offs

• $O(1)$ Random Access: Using the formula $\text{Element Address} = \text{Base Address} + \text{Index} \times \text{Size}$, the CPU can locate any element instantly.
• Amortized Analysis: By using an over-allocation strategy, although a single insertion may cost $O(n)$, the total cost becomes $n + \sum_{j=0}^{\lg n} 2^j = 3n$, ensuring amortized $O(1)$ performance for appends.
• Insertion Limitation: As shown in Figure 8-2, inserting at any position requires shifting all subsequent pointers, resulting in $O(n)$ complexity.